Lossless Grey-scale Image Compression using Source Symbols Reduction and Huffman Coding
نویسنده
چکیده
Usage of Image has been increasing and used in many applications. Image compression plays vital role in saving storage space and saving time while sending images over network. A new compression technique proposed to achieve more compression ratio by reducing number of source symbols. The source symbols are reduced by applying source symbols reduction and further the Huffman coding is applied to achieve compression. The source symbols reduction technique reduces the number of source symbols by combining together to form a new symbol. Therefore, the number of Huffman code to be generated also reduced. The Huffman code symbols reduction achieves better compression ratio. The experiment has been conducted using the proposed technique and the Huffman coding on standard images. The experiment result has analyzed and the result shows that the newly proposed compression technique achieves 10% more compression ratio than the regular Huffman coding.
منابع مشابه
Performance Analysis of Huffman Coding Algorithm
Huffman coding is such a widespread method for creating prefix-free codes. Huffman code is used as a synonym for prefix-free code even when such a code is not produced by Huffman's algorithm. Huffman coding is an efficient source coding algorithm for source symbols that are not equally probable. It yields the smallest possible number of code symbols per source symbol [7]. In this paper, the Los...
متن کاملPerformance Evaluation of Jpeg Image Compression Using Symbol Reduction Technique
Lossy JPEG compression is a widely used compression technique. Normally the JPEG technique uses two process quantization, which is lossy process and entropy encoding, which is considered lossless process. In this paper, a new technique has been proposed by combining the JPEG algorithm and Symbol Reduction Huffman technique for achieving more compression ratio. The symbols reduction technique re...
متن کاملModified Huffman Algorithm for Image Encoding and Decoding
Lossless compression of a progression of symbols is a decisive part of data and signal compression. Huffman coding is lossless in nature; it is also generally utilized in lossy compression as the eventual step after decomposition and quantization of a signal. In signal compression, the disintegration and quantization part seldom manages to harvest a progression of completely autonomous symbols....
متن کاملA new hybrid jpeg image compression scheme using symbol reduction technique
Lossy JPEG compression is a widely used compression technique. Normally the JPEG standard technique uses three process mapping reduces interpixel redundancy, quantization, which is lossy process and entropy encoding, which is considered lossless process. In this paper, a new technique has been proposed by combining the JPEG algorithm and Symbol Reduction Huffman technique for achieving more com...
متن کاملCombinatorial Entropy Encoding
This paper proposes a novel entropy encoding technique for lossless data compression. Representing a message string by its lexicographic index in the permutations of its symbols results in a compressed version matching Shannon entropy of the message. Commercial data compression standards make use of Huffman or arithmetic coding at some stage of the compression process. In the proposed method, l...
متن کامل